Tableau Proof Systems for Justification Logics
نویسنده
چکیده
In this paper we present tableau proof systems for various justification logics. We show that the tableau systems are sound and complete with respect to Mkrtychev models. In order to prove the completeness of the tableaux, we give a syntactic proof of cut elimination. We also show the subformula property for our tableaux.
منابع مشابه
Tableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very ...
متن کاملTowards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
One of the obstacles against the use of tableau-based theorem provers for non-standard logics is the ineeciency of tableau systems in practical applications, though they are highly intuitive and extremely exible from a proof theoretical point of view. We present a method for increasing the eeciency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of s...
متن کاملTableau methods of proof for modal logics
1 Introduction: In [1] Fitch proposed a new proof proceedure for several standard modal logics. The chief characteristic of this was the inclusion in the object language, of symbols representing worlds in Kripke models. In this paper we incorporate the device into a tableau proof system and it is seen that the resulting (propositional) proof system is highly analogous to a classical first order...
متن کاملA Tableau Compiled Labelled Deductive System for Hybrid Logic
Compiled Labelled Deductive Systems (CLDS) provide a uniform logical framework where families of different logics can be given a uniform proof system and semantics. A variety of applications of this framework have been proposed so far ranging from extensions of classical logics (e.g. normal modal logics and multi-modal logics) to non-classical logics such as resource and substructural loogics. ...
متن کاملA Tableau Proof System with Names for Modal Mu-calculus
Howard Barringer was a pioneer in the study of temporal logics with fixpoints [1]. Their addition adds considerable expressive power. One general issue is how to define proof systems for such logics. Here we examine proof systems for modal logic with fixpoints. We present a tableau proof system for checking validity of formulas which uses names to keep track of unfoldings of fixpoint variables ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1405.1828 شماره
صفحات -
تاریخ انتشار 2014